Stability Bounds on Step-sizf for the Partial Update Lms Algorithm
نویسنده
چکیده
Partial updating of LMS filter coefficients is an effective method for reducing the computational load and the power consumption in adaptive filter implementations. Only in the recent past has any work been done on deriving conditions for filter stability, convergence rate, and steady state error for the Partial Update LMS algorithm. In [5] approximate bounds were derived on the step size parameter 1-1 which ensure stability in-the-mean of the altemating evedodd index coefficient updating strategy. Unfortunately, due to the restrictiveness of the assumptions, these bounds are unreliable when fast convergence (large p ) is desired. In this paper, tighter bounds on 1-1 are derived which guarantee convergence inthe-mean of the coefficient sequence for the case of wide sense stationary signals.
منابع مشابه
Stability bounds on step-size for the partial update LMS algorithm
Partial updating of LMS filter coefficients is an effective method for reducing the computational load and the power consumption in adaptive filter implementations. Only in the recent past has any work been done on deriving conditions for filter stability, convergence rate, and steady state error for the Partial Update LMS algorithm. In [5] approximate bounds were derived on the step size param...
متن کاملStability analysis of the sequential partial update LMS algorithm
Partial updating of LMS filter coefficients is an effective method for reducing the computational load and the power consumption in adaptive filter implementations. The Sequential Partial Update LMS algorithm is one popular algorithm in this category. In [5] a first order stability analysis of this algorithm was performed on wide sense stationary signals under the restrictive assumption of smal...
متن کاملA Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms
In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...
متن کاملPartially decoupled Volterra filters: formulation and LMS adaptation
The adaptation of Volterra lters by one particular method, the method of least mean squares (LMS), while easily implemented, is complicated by the fact that upper bounds for the values of step sizes employed by a parallel update LMS scheme are diicult to obtain. In this paper, we propose a modiication of the Volterra lter in which the lter weights of a given order are optimized independently of...
متن کاملStability Conditions for the Leaky LMS Algorithm Based on Control Theory Analysis
The Least Mean Square (LMS) algorithm and its variants are currently the most frequently used adaptation algorithms; therefore, it is desirable to understand them thoroughly from both theoretical and practical points of view. One of the main aspects studied in the literature is the influence of the step size on stability or convergence of LMS-based algorithms. Different publications provide dif...
متن کامل